Current Issues in Linguistic Theory 114 ) THE EPSILON OPERATOR AND E - TYPE PRONOUNS

نویسنده

  • KLAUS VON HEUSINGER
چکیده

0. Introduction In this paper we attempt to provide a homogeneous description of definite and indefinite noun phrases. We therefore assume one semantic representation for one interpretation that the definite article the and the indefinite article a share. Our starting point is the classical theory of descriptions as developed by Russell in his famous article of 1905, " On Denoting. " In the first section we introduce the basic assumptions or intuitions that form the foundation for our considerations. Russell's analysis will be shown to be too restrictive to deal with natural language phenomena. The exposition of the intuitions will be more comprehensive than is usually the case, as we think that for a formalism devised for natural language description our basic ideas about language are at least as important as correctness and elegance in the formal model. Furthermore, it will become apparent that some other approaches to the descriptive content of common noun phrases actually fail because they do not pay sufficient attention to basic characteristics of natural language. In the second section a choice function, namely, the epsilon operator suggested by Hilbert, will be introduced and modified to capture the content of definite and indefinite descriptions adequately. Its properties will be compared with the basic ideas set forth in section 1. This will include a closer look at the well-ordering of sets and the dependency of descriptions on situations. In addition, we will introduce simple rules of thematization and rhematization that allow one to specify the description or to extract a predicate from a description. These rules are largely guided by the actual use of natural language. It will become clear that the modified epsilon operator is much more appropriate to the variations of actual language use than Russell's approach with the iota operator. In the third section we apply the analysis proposed in the second section with the help of epsilon to E-type pronouns. We will show that our analysis solves the problematic bishop-sentences, since it does not imply any uniqueness condition. The ideas developed in this paper go back to Egli (1991) (in circulation since 1989).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple Construction of a Frame which is $epsilon$-nearly Parseval and $epsilon$-nearly Unit Norm

In this paper, we will provide a simple method for starting with a given finite frame for an $n$-dimensional Hilbert space $mathcal{H}_n$ with nonzero elements and producing a frame which is $epsilon$-nearly Parseval and $epsilon$-nearly unit norm. Also, the concept of the $epsilon$-nearly equal frame operators for two given frames is presented. Moreover, we characterize all bounded invertible ...

متن کامل

GENERALIZED FUZZY POLYGROUPS

small Polygroups are multi-valued systems that satisfy group-likeaxioms. Using the notion of “belonging ($epsilon$)” and “quasi-coincidence (q)” offuzzy points with fuzzy sets, the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy subpolygroups isintroduced. The study of ($epsilon$, $epsilon$ $vee$ q)-fuzzy normal subpolygroups of a polygroupare dealt with. Characterization and some of the fundam...

متن کامل

Hesitant Fuzzy Linguistic Arithmetic Aggregation Operators in Multiple Attribute Decision Making

In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with hesitant fuzzy linguistic information. Then, motivated by the idea of traditional arithmetic operation, we have developed some aggregation operators for aggregating hesitant fuzzy linguistic information: hesitant fuzzy linguistic weighted average (...

متن کامل

Binding Illusions and resumption in Greek∗

The paper focuses on some apparent exceptions to the generalization that quantifiers resist CLLD in Greek. The main body of exceptions involves generic statements. Following Fox and Sauerland (1996) I argue that the Generic Operator, by involving quantification over situations, allows a trivialization of quantifiers like kathe(=each). Thus, in sentences with a generic operator the pronominal re...

متن کامل

POWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES

The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999